Optimal polynomial meshes and Caratheodory-Tchakaloff submeshes on the sphere
نویسندگان
چکیده
Using the notion of Dubiner distance, we give an elementary proof of the fact that good covering point configurations on the 2-sphere are optimal polynomial meshes. From these we extract CaratheodoryTchakaloff (CATCH) submeshes for compressed Least Squares fitting. 2010 AMS subject classification: 41A10, 65D32.
منابع مشابه
Caratheodory-Tchakaloff Subsampling
We present a brief survey on the compression of discrete measures by Caratheodory-Tchakaloff Subsampling, its implementation by Linear or Quadratic Programming and the application to multivariate polynomial Least Squares. We also give an algorithm that computes the corresponding CaratheodoryTchakaloff (CATCH) points and weights for polynomial spaces on compact sets and manifolds in 2D and 3D. 2...
متن کاملThermo-elastic analysis of a functionally graded thick sphere by differential quadrature method
Thermo-elastic analysis of a functionally graded hollow sphere is carried out and numerical solutions of displacement, stress and thermal fields are obtained using the Polynomial differential quadrature (PDQ) method. Material properties are assumed to be graded in the radial direction according to a power law function, ho...
متن کاملMotorcycle Graphs: Canonical Quad Mesh Partitioning
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein and Erickson to quad meshes. Our partitions may be used to efficiently find isomorphisms between quad meshes. In addition, they may be used as a highly compressed representation of the original mesh. These partitions c...
متن کاملVariable Degree Schwarz Methods for the Implicit Solution of Unsteady Compressible Navier-stokes Equations on Two-dimensional Unstructured Meshes
Vv'e report our experiences on using a new variant of the Schwarz preconditioned GMRES methods in the implicit solution of the unsteady compressible Navier-Stokes equations discretized on two-dimensional unstructured meshes. We first partition the global mesh with the recursive spectral bisection method into submeshes, and then we introduce a family of Schwarz methods, referred to as the Variab...
متن کاملDynamic Scheduling and Allocation in Two-Dimensional Mesh-Connected Multicomputers for Real-Time Tasks∗
Among several multiprocessor topologies, twodimensional (2D) mesh topology has become popular due to its simplicity and efficiency. Even though a number of scheduling and processor allocation schemes for 2D meshes have been proposed in the literature, little study has been done aimed for realtime environment. In this paper, we propose an on-line scheduling and allocation scheme for real-time ta...
متن کامل